Maximum-likelihood parameter estimation of the harmonic, evanescent, and purely indeterministic components of discrete homogeneous random fields
نویسندگان
چکیده
This paper presents a maximum-likelihood solution to the general problem of tting a parametric model to observations from a single realization of a 2-D homogeneous random eld with mixed spectral distribution. On the basis of a 2-D Wold-like decomposition, the eld is represented as a sum of mutually orthogonal components of three types: purelyindeterministic, harmonic, and evanescent. The suggested algorithm involves a two-stage procedure. In the rst stage we obtain a suboptimal initial estimate for the parameters of the spectral support of the evanescent and harmonic components. In the second stage we re ne these initial estimates by iterative maximization of the conditional likelihood of the observed data, which is expressed as a function of only the parameters of the spectral supports of the evanescent and harmonic components. The solution for the unknown spectral supports of the harmonic and evanescent components reduces the problem of solving for the other unknown parameters of the eld to linear least squares. The CramerRao lower bound on the accuracy of jointly estimating the parameters of the di erent components is derived, and it is shown that the bounds on the purely-indeterministic and deterministic components are decoupled. Numerical evaluation of the bounds provides some insight into the e ects of various parameters on the achievable estimation accuracy. The performance of the Maximum-Likelihood algorithm is illustrated by Monte-Carlo simulations and is compared with the Cramer-Rao bound.
منابع مشابه
Bounds on the accuracy of estimating the parameters of discrete homogeneous random fields with mixed spectral distributions
This paper considers the achievable accuracy in jointly estimating the parameters of a real-valued twodimensional (2-D) homogeneous random field with mixed spectral distribution, from a single observed realization of it. On the basis of a 2-D Wold-like decomposition, the field is represented as a sum of mutually orthogonal components of three types: purely indeterministic, harmonic, and evanesc...
متن کاملMaximum likelihood parameter estimation of textures using a Wold-decomposition based model
We present a solution to the problem of modeling, parameter estimation, and synthesis of natural textures. The texture field is assumed to be a realization of a regular homogeneous random field, which can have a mixed spectral distribution. On the basis of a 2-D Wold-like decomposition, the field is represented as a sum of a purely indeterministic component, a harmonic component, and a countabl...
متن کاملCramer-Rao bound on the estimation accuracy of complex-valued homogeneous Gaussian random fields
This paper considers the problem of the achievable accuracy in jointly estimating the parameters of a complex-valued two-dimensional (2-D) Gaussian and homogeneous random field from a single observed realization of it. Based on the 2-D Wold decomposition, the field is modeled as a sum of purely indeterministic, evanescent, and harmonic components. Using this parametric model, we first solve a k...
متن کاملA spectral 2-D Wold decomposition algorithm for homogeneous random fields
The theory of the 2-D Wold decomposition of homogeneous random elds is eeective in image and video analysis, synthesis, and model-ing. However, a robust and computationally ef-cient decomposition algorithm is needed for use of the theory in practical applications. This paper presents a spectral 2-D Wold decomposition algorithm for homogeneous and near homogeneous random elds. The algorithm reli...
متن کاملA Spectral D Wold Decomposition Algorithm for Homogeneous Random Fields
The theory of the D Wold decomposition of homogeneous random elds is e ective in im age and video analysis synthesis and model ing However a robust and computationally ef cient decomposition algorithm is needed for use of the theory in practical applications This pa per presents a spectral D Wold decomposition algorithm for homogeneous and near homoge neous random elds The algorithm relies on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 1996